A Harmony Search with Adaptive Pitch Adjustment for Continuous Optimization
نویسنده
چکیده
The Harmony Search is a relatively new meta-heuristic algorithm for continuous optimization, in which its concept imitates the process of music improvisation. This paper proposes an improved harmony search algorithm called Harmony Search with Adaptive Pitch Adjustment (HSAPA). The adaptive pitch adjustment scheme during a search period is inspired from the velocity clamping in particle swarm optimizations. The pitch adjustment rate is also dynamically adapted. The proposed algorithm is evaluated using thirteen wellknown benchmark functions of various characteristics. The experiment is performed using both 30 and 100 dimensions to investigate its performance at both medium and high number of decision variables. The experimental results demonstrate that HSAPA is reliably superior to all prior well-known harmony search variants and a recent widely-accepted variant of Differential Evolution algorithm. Furthermore, performance of HSAPA is shown not to be sensitive to its new parameter, which regulates the size of pitch adjustment.
منابع مشابه
DISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملA self-adaptive harmony PSO search algorithm and its performance analysis
Harmony Search (HS) algorithm is a new population-based meta-heuristic which imitates the music improvisation process and has been successfully applied to a variety of combination optimization problems. In this paper, a self-adaptive harmony particle swarm optimization search algorithm, named SHPSOS, is proposed to solve global continuous optimization problems. Firstly, an efficient initializat...
متن کاملIIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کاملEFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS
Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...
متن کاملA simplified binary harmony search algorithm for large scale 0-1 knapsack problems
As an important subset of combinatorial optimization, 0–1 knapsack problems, especially the highdimensional ones, are often difficult to solve. This study aims to provide a new simplified binary harmony search (SBHS) algorithm to tackle such NP-hard problems arising in diverse research fields. The key difference between SBHS and other HS methods is in the process of improvisation. The differenc...
متن کامل